全文获取类型
收费全文 | 9452篇 |
免费 | 1213篇 |
国内免费 | 392篇 |
专业分类
化学 | 809篇 |
晶体学 | 21篇 |
力学 | 1073篇 |
综合类 | 345篇 |
数学 | 5999篇 |
物理学 | 2810篇 |
出版年
2024年 | 14篇 |
2023年 | 95篇 |
2022年 | 234篇 |
2021年 | 274篇 |
2020年 | 197篇 |
2019年 | 212篇 |
2018年 | 241篇 |
2017年 | 366篇 |
2016年 | 461篇 |
2015年 | 307篇 |
2014年 | 568篇 |
2013年 | 623篇 |
2012年 | 522篇 |
2011年 | 570篇 |
2010年 | 455篇 |
2009年 | 594篇 |
2008年 | 622篇 |
2007年 | 656篇 |
2006年 | 524篇 |
2005年 | 464篇 |
2004年 | 408篇 |
2003年 | 345篇 |
2002年 | 322篇 |
2001年 | 278篇 |
2000年 | 248篇 |
1999年 | 217篇 |
1998年 | 199篇 |
1997年 | 171篇 |
1996年 | 143篇 |
1995年 | 115篇 |
1994年 | 81篇 |
1993年 | 93篇 |
1992年 | 76篇 |
1991年 | 44篇 |
1990年 | 52篇 |
1989年 | 33篇 |
1988年 | 31篇 |
1987年 | 27篇 |
1986年 | 32篇 |
1985年 | 31篇 |
1984年 | 29篇 |
1983年 | 11篇 |
1982年 | 19篇 |
1981年 | 10篇 |
1980年 | 7篇 |
1979年 | 8篇 |
1978年 | 5篇 |
1977年 | 7篇 |
1959年 | 6篇 |
1957年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 24 毫秒
991.
ZHANG Jingfu XIE Jingyi DENG Zhiwei & LU Zhiheng Key Laboratory for Quantum Information Measurements Department of Physics Tsinghua University Beijing China Center for Quantum Information Tsinghua University Beijing China Department of Materials Science Engineering Beijing Normal University Beijing China Testing Analytical Center Beijing Normal University Beijing China Department of Physics Beijing Normal University Beijing China 《中国科学G辑(英文版)》2005,48(1):57-67
Dense coding using superpositions of Bell-states is proposed. The generalized Grover's algorithm is used to prepare the initial entangled states, and the reverse process of the quantum algorithm is used to determine the entangled state in the decoding measurement. Compared with the previous schemes, the superpositions of two Bell-states are exploited. Our scheme is demonstrated using a nuclear magnetic resonance (NMR) quantum computer. The corresponding manipulations are obtained. Experimental results show a good agreement between theory and experiment. We also generalize the scheme to transmit eight messages by introducing an additional two-state system. 相似文献
992.
Stanis?aw Gawiejnowicz Wies?aw Kurc Lidia Pankowska 《Discrete Applied Mathematics》2006,154(15):2150-2166
In the paper a single machine time-dependent scheduling problem is considered. The processing time pj of each job is described by a function of the starting time t of the job, pj=1+αjt, where the job deterioration rate αj?0 for j=0,1,…,n and t?0. Jobs are nonpreemptable and independent, there are no ready times and no deadlines. The criterion of optimality of a schedule is the total completion time.First, the notion of a signature for a given sequence of job deterioration rates is introduced, two types of the signature are defined and their properties are shown. Next, on the basis of these properties a greedy polynomial-time approximation algorithm for the problem is formulated. This algorithm, starting from an initial sequence, iteratively constructs a new sequence concatenating the previous sequence with new elements, according to the sign of one of the signatures of this sequence.Finally, these results are applied to the problem with job deterioration rates which are consecutive natural numbers, αj=j for j=0,1,…,n. Arguments supporting the conjecture that in this case the greedy algorithm is optimal are presented. 相似文献
993.
Fabrice Guillemin Bruno Sericola 《Methodology and Computing in Applied Probability》2007,9(4):521-540
Motivated by queueing systems playing a key role in the performance evaluation of telecommunication networks, we analyze in
this paper the stationary behavior of a fluid queue, when the instantaneous input rate is driven by a continuous-time Markov
chain with finite or infinite state space. In the case of an infinite state space and for particular classes of Markov chains
with a countable state space, such as quasi birth and death processes or Markov chains of the G/M/1 type, we develop an algorithm
to compute the stationary probability distribution function of the buffer level in the fluid queue. This algorithm relies
on simple recurrence relations satisfied by key characteristics of an auxiliary queueing system with normalized input rates.
相似文献
994.
本文首先将半定规划转化为一个变分不等式问题,在满足单调性和Lipschitz连续的条件下,提出了一种基于Korpelevich-Khobotv算法的新的预测-校正算法,并给出算法的收敛性分析. 相似文献
995.
Liang Heng Liu Qinghua Bai Fengshan 《高校应用数学学报(英文版)》2005,20(4):483-490
The generation of good pseudo-random numbers is the base of many important fields in scientific computing, such as randomized algorithms and numerical solution of stochastic differential equations. In this paper, a class of random number generators (RNGs) based on Weyl sequence is proposed. The uniformity of those RNGs is proved theoretically. Statistical and numerical computations show the efficiency of the methods. 相似文献
996.
The fundamental solutions of elasticity are used to establish a numerical method for elastic and plastic multiple crack problems in two dimensions. The continuous distributions of the point forces, dislocations, and the plastic sources are used systematically to model the crack, non-crack boundary, and the plastic deformation. Use of these singularities are guided strictly by the physical interpretation of the problem. We adopt Muskhelishvili's complex variable formalism that facilitate the analytical evaluation of the integrals representing the continuous distributions of the singularities. The resulting numerical method is concise and accurate enough to be used for elastic and plastic multiple crack problems. 相似文献
997.
连续时间遗传算法模型及其强收敛性分析 总被引:4,自引:0,他引:4
本文在隐马尔可夫链的框架下利用隐马尔可夫链{Xt:t∈[0,∞)}的观测链的概率分布提出一个连续化遗传算法模型,并给出其一个强收敛结果,讨论了其离散骨架的性质。 相似文献
998.
Naoki Kawashima 《Journal of statistical physics》1996,82(1-2):131-153
We present cluster Monte Carlo algorithms for theXYZ quantum spin models. In the special case ofS=1/2, the new algorithm can be viewed as a cluster algorithm for the 8-vertex model. As an example, we study theS=1/2XY model in two dimensions with a representation in which the quantization axis lies in the easy plane. We find that the numerical autocorrelation time for the cluster algorithm remains of the order of unity and does not show any significant dependence on the temperature, the system size, or the Trotter number. On the other hand, the autocorrelation time for the conventional algorithm strongly depends on these parameters and can be very large. The use of improved estimators for thermodynamic averages further enhances the efficiency of the new algorithms. 相似文献
999.
The paper present a linear-time algorithm for solving the two machine open shop scheduling problem to minimize an arbitrary regular penalty function depending on the lengths of periods during which the machines are used. Both the preemptive and the nonpreemptive cases of the problem are considered. 相似文献
1000.
Open shop problems with unit time operations 总被引:2,自引:0,他引:2
Peter Brucker Bernd Jurisch Marion Jurisch 《Mathematical Methods of Operations Research》1993,37(1):59-73
We show that them-machine open shop problem in which all operations have unit processing times can be polynomially transformed to a special preemptive scheduling problem onm identical parallel machines. Many results published recently as well as some new results are derived by using this transformation. The new results include solutions of open problems mentioned in a recent paper by Kubiak et al. p]A similar relationship is derived between no-wait open shop problems with unit time operations andm-machine problems with jobs having unit processing times.This work was supported by Deutsche Forschungsgemeinschaft (Project JoPTAG). 相似文献